Constrained Fault-Tolerant Resource Allocation
نویسندگان
چکیده
We follow [18,25] and give a series of improved results for the Constrained Fault-Tolerant Resource Allocation (FTRA) problem. In FTRA, we are given a set of sites containing facilities as resources, and a set of clients consuming these resources. Specifically, each site i is allowed to open at most Ri facilities with cost fi for each opened facility. Each client j requires an allocation of rj facilities and connecting j to any facility at site i incurs a connection cost cij . The goal is to minimize the total cost of this resource allocation scenario. FTRA generalizes the Unconstrained Fault-Tolerant Resource Allocation (FTRA∞) [18] and the classical Fault-Tolerant Facility Location (FTFL) [13] problems: for every site i, FTRA∞ does not have the constraint Ri, whereas FTFL sets Ri = 1. These problems are said to be uniform if all rj ’s are the same, and general otherwise. In this paper, we strive to close the gap between FTRA and FTFL from the perspective of approximation. For the general metric FTRA, we first give an LP-rounding algorithm achieving the approximation ratio of 4. Then we show its reduction to FTFL, implying the ratio of 1.7245. For the uniform FTRA, we provide a 1.52-approximation primal-dual algorithm in O ( n ) , where n is the total number of sites and clients. For completeness in the line of [25] for FTFL, we also consider the Constrained Fault-Tolerant k-Resource Allocation (KFTRA) problem where additionally the total number of facilities can be opened across the sites is at most k. For the uniform KFTRA, we give the first constantfactor approximation algorithm with a factor of 4. Note that the above results carry over to FTRA∞ and KFTRA∞.
منابع مشابه
A Budget and Deadline Constrained Fault Tolerant Load Balanced Scheduling Algorithm for Computational Grids
Grid is an environment with millions of resources which are dynamic and heterogeneous in nature. A computational grid is one in which the resources are computing nodes and is meant for applications that involves larger computations. A scheduling algorithm is said to be efficient if and only if it performs better resource allocation even in case of resource failure. Resource allocation is a tedi...
متن کاملUnconstrained and Constrained Fault-Tolerant Resource Allocation
First, we study the Unconstrained Fault-Tolerant Resource Allocation (UFTRA) problem (a.k.a. FTFA problem in [19]). In the problem, we are given a set of sites equipped with an unconstrained number of facilities as resources, and a set of clients with setR as corresponding connection requirements, where every facility belonging to the same site has an identical opening (operating) cost and ever...
متن کاملAn Operational Approach to Budget-constrained Reliability Allocation
In this paper the problem of maximal increase of system reliability is formulated as a resource allocation problem under a budget constraint. Dynamic programing is used for the optimal solution. Time to system failure is dictated by a Markov process. The system is composed of several subsystems. Each subsystem has several possible configurations that exhibit different levels of fault tolerance ...
متن کاملA Multiconstrained Grid Scheduling Algorithm with Load Balancing and Fault Tolerance
Grid environment consists of millions of dynamic and heterogeneous resources. A grid environment which deals with computing resources is computational grid and is meant for applications that involve larger computations. A scheduling algorithm is said to be efficient if and only if it performs better resource allocation even in case of resource failure. Allocation of resources is a tedious issue...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1208.3835 شماره
صفحات -
تاریخ انتشار 2012